On the competitiveness of the move - to - front rule 1 Conrado Mart
نویسنده
چکیده
We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan (1985) and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an o -line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competitive for any constant c, MTF included. c © 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
On the competitiveness of the move-to-front rule
We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan 13] and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an oo-line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competitive ...
متن کاملSurvey of the Competitiveness of the Iranian Petrochemical Industry
One of the specific aspects of our time is the existence of World Trade Organization as an important international center. This organization regulates the commercial laws among the countries, and tries to provide a suitable environment for trade by eliminating the subsidies using protection policies and making a better condition for competition. In order to achieve this objective, the economic ...
متن کاملInvestigating Pareto Front Extreme Policies Using Semi-distributed Simulation Model for Great Karun River Basin
This study aims to investigate the different management policies of multi-reservoir systems and their impact on the demand supply and hydropower generation in Great Karun River basin. For this purpose, the semi-distributed simulation-optimization model of the Great Karun River basin is developed. Also, the multi-objective particle swarm optimization algorithm is applied to optimize the develop...
متن کاملVerified Analysis of List Update Algorithms
This paper presents a machine-verified analysis of a number of classical algorithms for the list update problem: 2-competitiveness of move-to-front, the lower bound of 2 for the competitiveness of deterministic list update algorithms and 1.6-competitiveness of the randomized COMB algorithm, the best randomized list update algorithm known to date. The analysis is verified with help of the theore...
متن کاملارائه قانون تشویقی تولیدات پراکنده در سیستمی با قانون تسویه تمایزی و پیشنهاد الگوریتم جایابی و تعیین ظرفیت بهینه
Encourage people to investment in small-scale electricity generation and expansion of dispersed generation (DG) may have several advantages such as, reducing the needs for investment in power plants and transmission network developments, improving the competitiveness of electricity market and moderating the costs of electrical energy procurement. In this paper, an encouraging market rule in a p...
متن کامل